The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0) → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0, y) → y
gcd(s(x), 0) → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
le(s(x), s(y)) →⁺ le(x, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x), y / s(y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
pred :: 0':s → 0':s
minus :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
if_gcd :: true:false → 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
le, minus, gcd

They will be analysed ascendingly in the following order:
le < gcd
minus < gcd

(8) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
pred :: 0':s → 0':s
minus :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
if_gcd :: true:false → 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
le, minus, gcd

They will be analysed ascendingly in the following order:
le < gcd
minus < gcd

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Induction Base:
le(gen_0':s3_0(0), gen_0':s3_0(0)) →_R^Ω(1)
true

Induction Step:
le(gen_0':s3_0(+(n5_0, 1)), gen_0':s3_0(+(n5_0, 1))) →_R^Ω(1)
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) →_IH
true

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
pred :: 0':s → 0':s
minus :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
if_gcd :: true:false → 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
minus, gcd

They will be analysed ascendingly in the following order:
minus < gcd

(12) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
minus(gen_0':s3_0(a), gen_0':s3_0(+(1, n282_0))) → *4_0, rt ∈ Ω(n282₀)

Induction Base:
minus(gen_0':s3_0(a), gen_0':s3_0(+(1, 0)))

Induction Step:
minus(gen_0':s3_0(a), gen_0':s3_0(+(1, +(n282_0, 1)))) →_R^Ω(1)
pred(minus(gen_0':s3_0(a), gen_0':s3_0(+(1, n282_0)))) →_IH
pred(*4_0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(13) Complex Obligation (BEST)

(14) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
pred :: 0':s → 0':s
minus :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
if_gcd :: true:false → 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s3_0(a), gen_0':s3_0(+(1, n282_0))) → *4_0, rt ∈ Ω(n282₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

The following defined symbols remain to be analysed:
gcd

(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol gcd.

(16) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
pred :: 0':s → 0':s
minus :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
if_gcd :: true:false → 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s3_0(a), gen_0':s3_0(+(1, n282_0))) → *4_0, rt ∈ Ω(n282₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(17) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(18) BOUNDS(n^1, INF)

(19) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
pred :: 0':s → 0':s
minus :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
if_gcd :: true:false → 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s3_0(a), gen_0':s3_0(+(1, n282_0))) → *4_0, rt ∈ Ω(n282₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(20) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(21) BOUNDS(n^1, INF)

(22) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
pred(s(x)) → x
minus(x, 0') → x
minus(x, s(y)) → pred(minus(x, y))
gcd(0', y) → y
gcd(s(x), 0') → s(x)
gcd(s(x), s(y)) → if_gcd(le(y, x), s(x), s(y))
if_gcd(true, s(x), s(y)) → gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) → gcd(minus(y, x), s(x))

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
pred :: 0':s → 0':s
minus :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
if_gcd :: true:false → 0':s → 0':s → 0':s
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
gen_0':s3_0 :: Nat → 0':s

Lemmas:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Generator Equations:
gen_0':s3_0(0) ⇔ 0'
gen_0':s3_0(+(x, 1)) ⇔ s(gen_0':s3_0(x))

No more defined symbols left to analyse.

(23) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s3_0(n5_0), gen_0':s3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(24) BOUNDS(n^1, INF)